perf(crypto): Optimize hash to scalar operation for secp256k1 and secp256r1 #8799
+27
−17
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
…p256r1 In from_wide_bytes, use a single scalar multiplication rather than 255 doublings. This function is in turn called by hash_to_scalar. With this change the cost of hash_to_scalar is reduced from ~2800 nanoseconds to ~330 nanoseconds. Hashing to scalar is used for MEGa encryption and decryption, for generating challenges in ZK proofs, and for rerandomizing the presignature.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
In from_wide_bytes, use a single scalar multiplication rather than 255 doublings. This function is in turn called by hash_to_scalar. With this change the cost of hash_to_scalar is reduced from ~2800 nanoseconds to ~330 nanoseconds.
Hashing to scalar is used for MEGa encryption and decryption, for generating challenges in ZK proofs, and for rerandomizing the presignature.